Computational Complexity of Planning Based on Partial Information about the System's Present and Past States

نویسندگان

  • Chitta Baral
  • Le-Chi Tuan
  • Raul Trejo
  • Vladik Kreinovich
چکیده

Planning is a very important AI problem and it is also a very time consuming AI problem To get an idea of how complex dif ferent planning problems are it is useful to describe the computational complexity of di erent general planning problems This complexity has been described for problems in which planning is based on the complete or partial information about the current state of the system In real life planning in addition to this information we often also use the knowledge about the system s past behavior To describe such more realistic plan ning situations a special language L was developed in by C Baral M Gelfond and A Provetti In this paper we expand the known results about computational complexity of planning including our own previ ous results about complexity of planning in the planning language A to this more general class of planning problems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity

In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...

متن کامل

Task Condition and L2 oral Performance: Investigating the Combined Effects of Online Planning and Immediacy

Research evidence reported to date demonstrates the differential effects of manipulating second language (L2) task conditions on the resultant production as measured in terms of complexity, accuracy, and fluency. The present study was aimed at adding to the available body of findings by exploring the synergistic effects of two task condition variables, namely online planning and immediacy (± He...

متن کامل

Task Complexity Manipulation and EFL learners’ interactions in the process of collaborative pre-planning

Today, learners’ interaction and collaborative task performance have attracted increasing attention from language teachers and researchers. The present study investigated whether collaborative pre-planning, task complexity manipulation, and language proficiency level play a role in learners’ interactions. To this end, 128 EFL learners from two different language proficiency levels carried out t...

متن کامل

TRANSPORT ROUTE PLANNING MODELS BASED ON FUZZY APPROACH

Transport route planning is one of the most important and frequent activities in supply chain management. The design of information systems for route planning in real contexts faces two relevant challenges: the complexity of the planning and the lack of complete and precise information. The purpose of this paper is to nd methods for the development of transport route planning in uncertainty dec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000